翻訳と辞書 |
Suffix automaton : ウィキペディア英語版 | Suffix automaton
In computer science, a suffix automaton is a data structure that efficiently represents the suffixes of a string. For example, a suffix automaton for the string "suffix" can be queried for other strings; it will report "true" for any of the strings "suffix", "uffix", "ffix", "fix", "ix" and "x", and "false" for any other string. The suffix automaton of a set of strings has at most states, where is the number of nodes of a prefix-tree representing the strings in . A suffix automaton is a type of finite state machine. It can be regarded as a compressed suffix trie. ==See also==
* Suffix array
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Suffix automaton」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|